package com.example.arithmeticleetcode.leetcode.august;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeMap;

/**
 * @program: arithmetic-leetcode
 * @description:
 * @author: FangZhen
 * @create: 2020-08-04 10:27
 **/
public class Demo03 {

    public static void main(String[] args) {
        //2, [[1,0]]
        int[][] prerequisites1 = {{1,0}};
        System.out.println(canFinish(2, prerequisites1));//true
        int[][] prerequisites2 = {{1,0}, {0, 1}};
        System.out.println(canFinish(2, prerequisites2)); //false

        int[][] prerequisites3 = {{1,0}, {2, 1}};
        System.out.println(canFinish(3, prerequisites2)); //true
    }

    public static boolean canFinish(int numCourses, int[][] prerequisites) {
//        TreeMap<Integer>
//        for (int[] prerequisite : prerequisites) {
//
//        }
        return false;

    }
}
